Monotone decompositions of continua not separated by any subcontinua

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Simply Connected Homogeneous Continua Are Not Separated by Arcs

We show that locally connected, simply connected homogeneous continua are not separated by arcs. We ask several questions about homogeneous continua which are inspired by analogous questions in geometric group theory.

متن کامل

Monotone Decompositions of «continua1

A 0-continuum (9„-continuum) is a compact, connected, metric space that is not separated into infinitely many (more than n) components by any subcontinuum. The following results are among those proved. The first generalizes earlier joint work with E. J. Vought for ^„-continua, and the second generalizes earlier work by Vought for 6,-continua. A 0-continuum X admits a monotone, upper semicontinu...

متن کامل

Decompositions of Continua over the Hyperbolic Plane

The following theorem is proved. THEOREM. Let X be a homogeneous continuum such that Hl(X) ^ 0. Ij'$/ is the collection of maximal terminal proper subcontinua of X, then (1) The collection ff is a monotone, continuous, terminal decomposition ofX, (2) The nondegenerate elements of%? are mutually homeomorphic, indecomposable, cell-like, terminal, homogeneous continua of the same dimension as X, (...

متن کامل

Monotone Subsequences in Any Dimension

We exhibit sequences of n points in d dimensions with no long monotone subsequences, by which we mean when projected in a general direction, our sequence has no monotone subsequences of length n+d or more. Previous work proved that this function of n would lie between n and 2 n; this paper establishes that the coefficient of n is one. This resolves the question of how the Erdo s Szekeres result...

متن کامل

Any monotone boolean function can be realized by interlocked polygons

We show how to construct interlocked collections of simple polygons in the plane that fall apart upon removing certain combinations of pieces. Precisely, interiordisjoint simple planar polygons are interlocked if no subset can be separated arbitrarily far from the rest, moving each polygon as a rigid object as in a slidingblock puzzle. Removing a subset S of these polygons might keep them inter...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Transactions of the American Mathematical Society

سال: 1974

ISSN: 0002-9947

DOI: 10.1090/s0002-9947-1974-0341438-x